Normal bases of ray class fields over imaginary quadratic fields
نویسندگان
چکیده
منابع مشابه
Normal Bases of Ray Class Fields over Imaginary Quadratic Fields
We first develop a criterion to determine normal bases (Theorem 2.4), and by making use of necessary lemmas which were refined from [3] we further prove that singular values of certain Siegel functions form normal bases of ray class fields over all imaginary quadratic fields other than Q( √−1) and Q( √−3) (Theorem 4.5 and Remark 4.6). This result would be an answer for the Lang-Schertz conjectu...
متن کاملClass numbers of ray class fields of imaginary quadratic fields
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of Schoof to compute the class numbers of ray class fields Kp heuristically. We achieve this by using elliptic units analytically constructed by Stark and the Galois action on them given by Shimura’s reciprocity law. We have...
متن کاملBinary Normal Regular Hermitian Lattices over Imaginary Quadratic Fields
We call a positive definite Hermitian lattice regular if it represents all integers, which can be represented locally by the lattice. We investigate binary regular Hermitian lattices over imaginary quadratic fields Q( √ −m) and provide a complete list of the (normal) binary regular Hermitian lattices.
متن کاملClass numbers of imaginary quadratic fields
The classical class number problem of Gauss asks for a classification of all imaginary quadratic fields with a given class number N . The first complete results were for N = 1 by Heegner, Baker, and Stark. After the work of Goldfeld and Gross-Zagier, the task was a finite decision problem for any N . Indeed, after Oesterlé handled N = 3, in 1985 Serre wrote, “No doubt the same method will work ...
متن کاملVisualizing imaginary quadratic fields
Imaginary quadratic fields Q( √ −d), for integers d > 0, are perhaps the simplest number fields afterQ. They are equal parts helpful first example and misleading special case. LikeZ, the Gaussian integersZ[i] (the cased = 1) have unique factorization and a Euclidean algorithm. As d grows, however, these properties eventually fail, first the latter and then the former. The classical Euclidean al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2011
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-011-0854-2